Nearest multivariate system with given root multiplicities
نویسندگان
چکیده
منابع مشابه
Nearest multivariate system with given root multiplicities
We present a symbolic-numeric technique to find the closest multivariate polynomial system to a given one which has roots with prescribed multiplicity structure. Our method generalizes the “Weierstrass iteration”, defined by Ruatta, to the case when the input system is not exact, i.e. when it is near to a system with multiple roots, but itself might not have multiple roots. First, using interpo...
متن کاملComputing the nearest singular univariate polynomials with given root multiplicities
In this paper, we derive explicit expressions for the nearest singular polynomials with given root multiplicities and its distance to the given polynomial. These expressions can be computed recursively. These results extend previous results of (Zhi et al., 2004; Zhi and Wu, 1998).
متن کاملSome Generalized Kac-Moody Algebras With Known Root Multiplicities
Starting from Borcherds’ fake monster Lie algebra we construct a sequence of six generalized Kac-Moody algebras whose denominator formulas, root systems and all root multiplicities can be described explicitly. The root systems decompose space into convex holes, of finite and affine type, similar to the situation in the case of the Leech lattice. As a corollary, we obtain strong upper bounds for...
متن کاملA Fast Multivariate Nearest Neighbour Imputation Algorithm
imputation algorithms replace the missing values within any particular observation by taking copies of the corresponding known values from the most similar observation found in the dataset. However, when NN algorithms are executed against large multivariate datasets the poor performance (program execution speed) of these algorithms can present major practical problems. We argue that these probl...
متن کاملCRYSTAL GRAPHS AND q-ANALOGUES OF WEIGHT MULTIPLICITIES FOR THE ROOT SYSTEM
We give an expression of the q-analogues of the multiplicities of weights in irreducible sl n+1-modules in terms of the geometry of the crystal graph attached to the corresponding Uq(sl n+1)-modules. As an application, we describe multivariate polynomial analogues of the multiplicities of the zero weight, refining Kostant’s generalized exponents.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.03.005